Connected Compqnents with Split
نویسنده
چکیده
The split and merge model is a reasonable method for architecture-independent programming of global image processing operations on parallel architectures. We consider image connected components from the point of view of this programming model, and develop split and merge algorithms that implement various connected components algorithms that have appeared in the literature. The algorithms are implemented in two architectures independent languages we have developed, namely Apply and Adapt. Performance of the algorithms on the Sun, the Carnegie Mellon Warp, and the Camegie Mellon Nectar architectures is compared.
منابع مشابه
The edge tenacity of a split graph
The edge tenacity Te(G) of a graph G is dened as:Te(G) = min {[|X|+τ(G-X)]/[ω(G-X)-1]|X ⊆ E(G) and ω(G-X) > 1} where the minimum is taken over every edge-cutset X that separates G into ω(G - X) components, and by τ(G - X) we denote the order of a largest component of G. The objective of this paper is to determine this quantity for split graphs. Let G = (Z; I; E) be a noncomplete connected split...
متن کاملOn Chordal-k-Generalized Split Graphs
A graph G is a chordal-k-generalized split graph if G is chordal and there is a clique Q in G such that every connected component in G[V \ Q] has at most k vertices. Thus, chordal-1-generalized split graphs are exactly the split graphs. We characterize chordal-k-generalized split graphs by forbidden induced subgraphs. Moreover, we characterize a very special case of chordal-2-generalized split ...
متن کاملFully Decomposable Split Graphs
Wediscuss various questions around partitioning a split graph into connected parts. Our main result is a polynomial time algorithm that decides whether a given split graph is fully decomposable, that is, whether it can be partitioned into connected parts of orders α1, α2, . . . , αk for every α1, α2, . . . , αk summing up to the order of the graph. In contrast, we show that the decision problem...
متن کاملCannon-Thurston Maps for Surface Groups II: Split Geometry and the Minsky Model
In earlier work, we had shown that the limit set of any surface group of split geometry is locally connected, by constructing a natural Cannon-Thurston map. We had also generalised this result to 3-manifolds whose cores have boundary that is incompressible away from cusps. Here, we show that all surface groups enjoy split geometry by using Minsky’s model for such groups. In combination with our...
متن کاملIwasawa decompositions of split Kac–Moody groups
The Iwasawa decomposition of a connected semisimple complex Lie group or a connected semisimple split real Lie group is one of the most fundamental observations of classical Lie theory. It implies that the geometry of a connected semisimple complex resp. split real Lie group G is controlled by any maximal compact subgroup K. Examples are Weyl’s unitarian trick in the representation theory of Li...
متن کامل